Enumeration and Special Functions
نویسنده
چکیده
1.1 q -binomial coefficients . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139 1.2 Unimodality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 140 1.3 Congruences for the partition function . . . . . . . . . . . . . . . . . . . . . . . . . 143 1.4 The Jacobi triple product identity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145 1.5 The Rogers-Ramanujan identities and the involution principle . . . . . 148 1.6 q -Hermite polynomials and the Rogers-Ramanujan identities . . . . . 150 1.7 Another q -binomial theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153
منابع مشابه
Type-Itemized Enumeration of RS-Stereoisomers of Octahedral Complexes
Stereoisograms of octahedral complexes are classified into five types (type I--typeV) under the action of the corresponding RS-stereoisomeric group. Their enumeration is accomplished in a type-itemized fashion, where Fujita's proligand method developed originally for combinatorial enumeration under point groups (S. Fujita, Theor. Chem. Acc., 113, 73--79 (2005)) is extended to meet the requireme...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملOn Dedekind's problem for complete simple games
We combine the parametric Barvinok algorithm with a generation algorithm for a finite list of suitably chosen discrete sub-cases on the enumeration of complete simple games, i. e. a special subclass of monotone Boolean functions. Recently, Freixas et al. have proven an enumeration formula for complete simple games with two types of voters. We will provide a shorter proof and an enumeration form...
متن کاملAiry Phenomena and Analytic Combinatorics of Connected Graphs
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipulations. We show here that it is possible to make analytic sense of the divergent series that expresses the generating function of connected graphs. As a consequence, it becomes possible to derive analytically known enum...
متن کاملSymbolization of generating functions; an application of the Mullin-Rota theory of binomial enumeration
We have found that there are more than a dozen classical generating functions that could be suitably symbolized to yield various symbolic sum formulas by employing Mullin-Rota’s theory of binomial enumeration. Various special formulas and identities involving well-known number sequences or polynomial sequences are presented as illustrative examples. The convergence of the symbolic summations is...
متن کامل